A Framework for Combining State Interpolation and Partial Order Reduction

We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there is statebased interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Second, there are tracebased methods, collectively known as “Partial Order Reduction (POR)”, which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Our main contribution is a framework that synergistically combines state interpolation with POR so that the sum is more than its parts.